Isomorphism of weighted trees and Stanley's isomorphism conjecture for caterpillars
نویسندگان
چکیده
منابع مشابه
The Isomorphism Conjecture for NP
In this article, we survey the arguments and known results for and against the Isomorphism Conjecture.
متن کاملOn the Isomorphism Conjecture for Weak Reducibilities
According to the isomorphism conjecture all NP-complete sets are polynomial-time isomorphic to each other while according to the encrypted complete set conjecture there is a p-one-way function f and an NP-complete set A such that A and f(A) are not polynomialtime isomorphic to each other. In this paper, these two conjectures are investigated for reducibilities weaker than polynomial-time. It is...
متن کاملThe isomorphism conjecture for constant depth reductions
For any class C closed under TC reductions, and for any measure u of uniformity containing Dlogtime, it is shown that all sets complete for C under u-uniform AC reductions are isomorphic under u-uniform AC-computable isomorphisms.
متن کاملThe isomorphism problem for ω-automatic trees
The main result of this paper is that the isomorphism for ω-automatic trees of finite height is at least has hard as second-order arithmetic and therefore not analytical. This strengthens a recent result by Hjorth, Khoussainov, Montalbán, and Nies [9] showing that the isomorphism problem for ω-automatic structures is not Σ 2 . Moreover, assuming the continuum hypothesis CH, we can show that the...
متن کاملIsomorphism of Regular Trees and Words
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a regular language. In case regular languages are represented by NFAs (DFAs), the isomorphism problem for regular trees turns out to be EXPTIME-complete (resp. P-complete). In case the input automata are acyclic NFAs (acy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l’Institut Henri Poincaré D
سال: 2019
ISSN: 2308-5827
DOI: 10.4171/aihpd/74